Pattern composition in graph transformation rules
نویسندگان
چکیده
Graph transformation (GT) frequently serves as a precise underlying specification mechanism for model transformations within and between modeling languages. However, composability of graph transformation rules is typically limited to inter-level rule composition (i.e. rules calling other rules). In the current paper, we introduce intra-level composition for GT rules where the left-hand side and right-hand side graphs of GT rules can be composed of stand-alone graph patterns in a fully declarative way. As a result, the specification of complex model transformation problems can be drastically reduced. Our concepts are demonstrated using the transformation language of the VIATRA2 framework.
منابع مشابه
An Interactive and Scalable Approach to Design Pattern Recovery
Reverse engineering is a process highly influenced by assumptions and hypotheses of a reverse engineer, who has to analyse a system manually, because tools are often not applicable to large systems with many different implementation styles. Successful tools have to support an interactive process, where the engineer is able to steer the analysis process by proving certain assumptions and hypothe...
متن کاملPattern-Based Graph Abstraction
We present a new abstraction technique for the exploration of graph transformation systems with infinite state spaces. This technique is based on patterns, simple graphs describing structures of interest that should be preserved by the abstraction. Patterns are collected into pattern graphs, layered graphs that capture the hierarchical composition of smaller patterns into larger ones. Pattern g...
متن کاملApplying Triple Graph Grammars For Pattern-Based Workflow Model Transformations
Workflow and business process modeling approaches have become essential for designing service collaborations when developing SOA-based systems. To derive actual executable business process descriptions from the high-level workflow models, model transformation techniques can be used. Various service composition and business process languages are available for describing the executable processes....
متن کاملStepping from Graph Transformation Units to Model Transformation Units
Graph transformation units are rule-based entities that allow to transform source graphs into target graphs via sets of graph transformation rules according to a control condition. The graphs and rules are taken from an underlying graph transformation approach. Graph transformation units specify model transformations whenever the transformed graphs represent models. This paper is based on the o...
متن کاملGraph Passing in Graph Transformation
Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which continually interact; the interactions pass information such as names or locations between components. The...
متن کامل